#define  _CRT_SECURE_NO_WARNINGS
#include"Tree.h"
BTNode* createNode(BTDataType x)
{
	BTNode* newnode = (BTNode*)malloc(sizeof(BTNode));
	if (newnode == NULL)
	{
		perror("malloc");
		exit(1);
	}
	newnode->data = x;
	newnode->left = newnode->right = NULL;
	return newnode;
}
void test01()
{
	BTNode* node1 = createNode('A');
	BTNode* node2 = createNode('B');
	BTNode* node3 = createNode('C');
	BTNode* node4 = createNode('D');
	BTNode* node5 = createNode('E');
	BTNode* node6 = createNode('F');

	node1->left = node2;
	node1->right = node3;
	node2->left = node4;
	node3->left = node5;
	node3->right = node6;

	printf("%d\n", BinaryTreeLeafSize(node1));
	printf("%d\n", BinaryTreeLevelKSize(node1,3));
	BinaryTreeLevelOrder(node1);
}



int main()
{
	test01();
	return 0;
}